Solving Economic Load Dispatch Problem Using Clustered Gravitational Search Algorithm Pranjal

نویسندگان

  • PRAGYA VERMA
  • PRAVEEN GANESH
  • G.AVINASH
  • K.CHANDRASEKARAN
چکیده

Gravitational search algorithm (GSA) is based on the law of gravity and a mass of interaction. In GSA, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. This paper proposes a new clustered gravitational search algorithm (CGSA) to accelerate the performance of the GSA. Here, the whole population is divided into three basic groups: namely the leader, the follower and the freelancer. In this way, the exploration in GSA is kept alive without killing the exploitation. To validate the proposed CGSA, the economic dispatch problem (EDP) is solved using CGSA for IEEE 30 bus system and 40 unit system. The performance of the proposed approach reveals the efficiency and robustness when compared results of other optimization algorithms reported in literature. KeywordsClustered gravitational search algorithm, economic dispatch problem, valve point effect.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem

This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...

متن کامل

Solving the Economic Load Dispatch Problem Considering Units with Different Fuels Using Evolutionary Algorithms

Nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. In this paper, a new method i.e. Water Cycle Algorithm (WCA) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. In order to investigate the eff...

متن کامل

Combined Economic and Emission Dispatch Solution Using Exchange Market Algorithm

This paper proposes the exchange market algorithm (EMA) to solve the combined economic and emission dispatch (CEED) problems in thermal power plants. The EMA is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. Existence of two seeking operators in EMA provides a high ability in exploiting global optimum point. In order to show the capabilities ...

متن کامل

Gravitational Search Algorithm for Solving Combined Economic and Emission Dispatch

This paper presents a gravitational search algorithm (GSA) for solving the combined economic and emission dispatch (CEED) problem in power systems. Numerical results for the standard IEEE 30-bus six-generator test system have been presented to illustrate the performance and applicability of the proposed approach. The results obtained are compared to those reported in the recent literature. Thos...

متن کامل

Intelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones

Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013